Method for constructing orthogonal sequence sets in CDMA system, code word generating device, communication base station, base station controller, and wireless communication network

ABSTRACT

The present invention relates to a method for constructing orthogonal sequence sets in a CDMA system, including: step a: selecting natural numbers m and k, m and k satisfying m=2k+4: step b: constructing a 5-spectral value vector Boolean function; step c: constructing 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function; and step d: allocating the orthogonal sequence sets to cells, and causing that sequences in each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with one another. The constructing method provided by the present invention can increase the number of users in cells, reduce the signal interferences of neighboring cells, and improves the communication quality consequently.

BACKGROUND OF THE INVENTION 1. Field of the Invention

The present invention relates to the field of wireless communication technologies, and in particular to a method for constructing orthogonal sequence sets in a CDMA system, a code word generating device, a communication base station, a base station controller, and a wireless communication network.

2. Description of Related Art

CDMA (Code Division Multiple Access), i.e., code division multiple access mobile communication is an epoch-making wireless communication technology. The principle the CDMA technology is based on a frequency spreading technology, that is, the to-be-transmitted information data with a certain signal bandwidth is modulated by a high-speed pseudo-random code of which the bandwidth is much larger than the signal bandwidth, so that the original data signal is expanded in bandwidth, and is then modulated by carriers and sent out. A receiving end uses the totally identical pseudo-random code to perform correlation processing with the received bandwidth signal, and the broadband signal is converted into a narrowband signal of the original information data, i.e., despreaded, to realize information communication.

The CDMA system is a communication system based on the code division technology. The system allocates a specific code word sequence to each user. The code word sequences have good orthogonality. These code word sequences with good orthogonality are used to code the information carried by the users. In this way, the information carried by different users be distinguished. The orthogonality of the code words in the CDMA system directly affects the anti-interference ability of the CDMA system.

At present, the user capacity of the CDMA system is obviously constrained by the orthogonal code words. Specifically, the number the orthogonal sequences generated by the prior art difficultly satisfies the increase trend of the number of users. As a result, the number of the users in cells is limited, the capacity of the CDMA system is constrained, and the development, of the CMDA system is restricted.

SUMMARY OF THE INVENTION

Therefore, in order to solve the defects and deficiencies of the prior art, the present invention provides a method for constructing orthogonal sequence sets in a CDMA system.

A method for constructing orthogonal sequence sets in a CDMA system, includes step a: selecting natural numbers m and k, m and k satisfying m=2k+4; step b: constructing a 5-spectral value vector Boolean function; step e: constructing 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function; and step d: allocating the orthogonal sequence sets to cells, and causing that sequences in each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with one another.

On the basis of the above embodiment, walsh spectral values, of the 5-spectral value vector Boolean function are {0, 2^(m/2), −2^(m/2), 2^((m/2)+1), −2^((m/2)+1)}, and a length of a 5-spectral value sequence corresponding to the 5-spectral value vector Boolean function is

On the basis of the above embodiment, the step b of constructing a 5-spectral value vector Boolean function comprises: F₂ ^(k) is a k-dimensional vector space, F₂ _(k) is a finite field with a feature of 2, and (b₁, b₂, . . . , b_(k))∈F₂ ^(k): γ is set to be a primitive element of F₂ _(k) , and {1, γ, . . . , γ^(k−1)} is a group of bases of F₂ _(k) , isomorphic π:F₂ _(k)

F₂ ^(k) is defined as that π(b₁+b₂γ+ . . . +b_(k)γ^(k−1))=(b₁, b₂, . . . , b_(k)); for i=0.1, ϕ_(i):F₂ ^(k)→F₂ ^(k) is set to be a permutation and is defined as:

${\phi_{i}(y)} = \left\{ {\begin{matrix} {0_{k},} & {y = 0_{k}} \\ {{\pi\left( \gamma^{{\lbrack y\rbrack} - i} \right)},} & {y \in F_{2}^{k*}} \end{matrix},} \right.$ [y] is a decimal representation of y: ψ₀ and ψ₁ are set to be two permutations of F_(k) ², and: ψ₁(00)=00, ψ₁(01)=10, ψ₁(10)=0.1, ψ₁(11)=11, ψ₂(00)=00, ψ₂(01)=01, ψ₂(10)=11, ψ₂(11)=10, X=(x₁, x₂, . . . , x_(m))∈F₂ ^(m), X₀=(x₃, . . . , x_(k+1))∈F₂ ^(k), X₁=(x_(k+3), . . . , x_(m−2))∈F₂ ^(k), X′₀=(x₂, . . . , x_(k+1))∈F₂ ^(k), and X′₁=(x_(k+2), . . . , x_(m−3))∈F₂ ^(k) are set; then a method for constructing the 5-spectral value vector Boolean function F F:F₂ ^(m)→F₂ ² is as follows: F(X)=(f₀(X), f₁(X)), i=0, 1,

${f_{i}(X)} = \left\{ {\begin{matrix} {{{{\phi_{i}\left( X_{0} \right)} \cdot X_{1}} + {{\psi_{i}\left( {x_{1},x_{2}} \right)} \cdot \left( {x_{m - 1},x_{m}} \right)}},} & {{{{if}\mspace{14mu}\left( {x_{1},x_{2}} \right)} \in \left\{ {10,11} \right\}},{X_{1} \in F_{2}^{k}}} \\ {{{\phi_{i}\left( X_{0}^{\prime} \right)} \cdot X_{1}^{\prime}},} & {{{{if}\mspace{14mu} x_{1}} = 0},{X_{1}^{\prime} \in F_{2}^{k}}} \end{matrix}.} \right.$

On the basis of the above embodiment, the step c of constructing 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function includes: dividing a 2^(m)×2^(m) dimensional Hadamard matrix into six orthogonal sequence sets according to a preset rule, wherein any one of two of the six orthogonal sequence sets contains 2^(m−2) sequences, and any one of remaining four of the six orthogonal sequence sets contains 2^(m−3) sequences: obtaining four 5-spectral value Boolean functions according to the 5-spectral value vector Boolean function; converting truth tables of the four 5-spectral value Boolean functions into 1 or −1, to thereby form four 5-spectral value sequence sets; and multiplying each of the six orthogonal sequence sets by the four 5-spectral value sequence sets individually to obtain the 24 orthogonal sequence sets.

On the basis of the above embodiment, the step of converting truth tables of the four 5-spectral value Boolean functions into 1 or −1 includes: recording a value of the 5-spectral value Boolean function as 1 in the truth table, if the value of the 5-spectral value Boolean function is 0; and recording a value of the 5-spectral value Boolean function as −1 in the truth table, if the value of the 5-spectral value Boolean function is 1.

On the basis of the above embodiment, after the step d of allocating the orthogonal sequence sets to cells, and causing that sequences within each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with another, the method further includes: minimizing a correlation value mutually spaced ones the cells, so as to reduce interference of the CDMA system.

A code word generating device is applied to a CDMA wireless communication system and includes: a sequence generating unit, configured to generate orthogonal sequence sets; a storage unit, electrically connected to the sequence generating unit, and configured to store the orthogonal sequence sets; a reading unit, electrically connected to the storage unit, and configured to read the orthogonal sequence sets subjected to a control signal; and a transceiving unit, electrically connected to the reading unit, and configured to receive and transmit user information coded by using the orthogonal sequence sets.

In an embodiment, the sequence generating unit includes: a selecting subunit, configured to select natural numbers m and k, m and k satisfying m=2k+4; a first constructing subunit, connected to the selecting subunit, and configured to construct a 5-spectral value vector Boolean Function; a second constructing subunit, connected to the first constructing subunit, and configured to construct 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function; and an allocating subunit, connected to the second constructing subunit, and configured to allocate the orthogonal sequence sets to cells according to a preset rule, and cause that sequences in each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with one another.

In an embodiment, walsh spectral values of the 5-spectral value vector Boolean function as {0, 2^(m/2), −2^(m/2), 2^(m/2)+1), −2^((m/2)+1)}, and a length of a 5-spectral value sequence corresponding to the 5-spectral value vector Boolean function is 2^(m).

In an embodiment, the first constructing subunit is specifically configured for that: F₂ ^(k) is a k-dimensional vector space, F₂ _(k) is a finite field with a feature of 2, and (h₁, h₂, . . . , b_(k))∈F₂ ^(k): γ is set to be a primitive element of F₂ _(k) , and {1, γ, . . . , γ^(k−1)} is a group of bases of F₂ _(k) , isomorphic π:F₂ _(k)

F₂ ^(k) is defined as that π(b₁+b₂γ+ . . . +b_(k)γ^(k−1))=(b₁, b₂, . . . , b_(k)), for i=0, 1, ϕ₁:F₂ ^(k)→F₂ ^(k) is set to be a permutation and is defined as:

${\phi_{i}(y)} = \left\{ {\begin{matrix} {0_{k},} & {y = 0_{k}} \\ {{\pi\left( \gamma^{{\lbrack y\rbrack} + i} \right)},} & {y \in F_{2}^{k*}} \end{matrix},} \right.$ wherein [y] is a decimal representation of y; ψ₀ and ψ₁ are set to be two permutations of F₂ ², and ψ₁(00)=00, ψ₁(01)=10, ψ₁(10)=01, ψ₁(11)=11, ψ₂(00)=00, ψ₂(01)=01, ψ₂(10)=11, ψ₂(11)=10, X=(x₁, x₂, . . . , x_(m))∈F₂ ^(m), X₀=(x₃, . . . , x_(k+2))∈F₂ ^(k), X₁=(x_(k+3), . . . , x_(m+2))∈F₂ ^(k), X′₀=(x₂, . . . , x_(k+1))∈F₂ ^(k), and X′₁=(x_(k+1), . . . , x_(m−3))∈F₂ ^(k) are set; then a method for constructing the 5-spectral value Boolean function F F:F₂ ^(m)

F₂ ² is as follows:

${{F(X)} = \left( {{f_{0}(X)},{f_{1}(X)}} \right)},{i = 0},1,{{f_{i}(X)} = \left\{ {\begin{matrix} {{{{\phi_{i}\left( X_{0} \right)} \cdot X_{1}} + {{\psi_{i}\left( {x_{1},x_{2}} \right)} \cdot \left( {x_{m - 1},x_{m}} \right)}},} & {{{{if}\mspace{14mu}\left( {x_{1},x_{2}} \right)} \in \left\{ {10,11} \right\}},{X_{1} \in F_{2}^{k}}} \\ {{{\phi_{i}\left( X_{0}^{\prime} \right)} \cdot X_{1}^{\prime}},} & {{{{if}\mspace{14mu} x_{1}} = 0},{X_{1}^{\prime} \in F_{2}^{k}}} \end{matrix}.} \right.}$

In an embodiment, the second constructing subunit includes: a dividing module, configured to divide a 2^(m)×2^(m) dimensional Hadamard matrix into six orthogonal sequence sets according to a preset rule, wherein any one of two of the six orthogonal sequence sets contains 2^(m−2) sequences, and any one of remaining four of the six orthogonal sequence sets contains 2^(m−3) sequences; an obtaining module, connected to the dividing module, and configured to obtain four 5-spectral value Boolean functions according to the 5-spectral value vector Boolean function; a converting module, connected to the dividing module, and configured to convert truth tables of the four 5-spectral value Boolean functions into 1 or −1, to form four 5-spectra value sequence sets; and a multiplying module, connected to the converting module, and configured to multiply each of the six orthogonal sequence sets by the four 5-spectral value sequence sets individually to obtain the 24 orthogonal sequence sets.

The present invention further provides a communication base station including the code word generating device according to any one of the above embodiments.

The present invention still further provides a base station controller including the code word generating device according to any one of the above embodiments.

The present invention even still further provides a wireless communication network including the communication base station or the base station controller.

The constructing method provided by the present invention can increase the number of users in cells, reduce the signal interference of neighboring cells, and improves the communication quality consequently.

BRIEF DESCRIPTION OF THE DRAWINGS

The specific embodiments of the present invention will be illustrated in detail in combination with the drawings.

FIG. 1 is a flowchart of a method for constructing orthogonal sequence sets in a CDMA system according to an embodiment of the present invention.

FIG. 2 is a schematic diagram of allocating sequence sets in a plurality of cells according to an embodiment of the present invention.

FIG. 3 is a schematic structural diagram of a code word generating device according to the present invention.

FIG. 4 is schematic structural diagram of a sequence generating unit according to the present invention.

FIG. 5 is a schematic structural diagram of a second constructing subunit according to the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

In the following, with reference to accompanying drawings of embodiments of the invention, technical solutions in the embodiments of the invention will be dearly and completely described. Apparently, the embodiments of the invention described below only are a part of embodiments of the invention, but not all embodiments. Based on the described embodiments of the invention, all other embodiments obtained by ordinary skill in the art without creative effort belong to the scope of protection of the invention.

Embodiment 1

In order to better illustrate the method provided by the present invention, the technical background of the present invention will be firstly described as follows.

At first some concepts and tools related to a Boolean function and the sequence will be introduced. The main tool is walsh transformation.

F₂ ^(m) is set to an m-dimensional vector space, F₂ _(m) is a finite field on GF(2), wherein GF(2) is the finite field in modern algebra, then the m-elementary Boolean function ƒ(x) is represented as a mapping of some F₂ ^(m) to F₂. Herein, x=(x₁, . . . , x_(m))∈F₂ ^(m). B_(m) is set to represent a set of all m-elementary Boolean functions. For convenience, the addition operation in F₂ ^(m) and F₂ _(m) is replaced with “+” and Σ_(i). Any Boolean function f∈B_(m) can be represented by its algebraic regular type:

${{f\left( {x_{1},\ldots\mspace{14mu},x_{m}} \right)} = {\sum\limits_{b \in F_{2}^{m}}^{\;}{\lambda_{b}\left( {\prod\limits_{i = 1}^{m}\; x_{i}^{b_{i}}} \right)}}},$ wherein λ_(b)∈F₂, b=(b₁, . . . , b_(m))∈F₂ ^(m). The algebra degree of ƒ(x) is the minimum value of wt(b) enabling λ_(b)≠0, and is recorded as deg(f), wherein wt(b) is the Hamming weight of b. When deg(ƒ)=1, ƒ is called an affine function.

For a=(a₁, . . . , a_(m))∈F₂ ^(m), b=(b₁, . . . b_(m))∈F₂ ^(m). Then the inner product of a and b is defined as:

${{a \cdot b} = {\sum\limits_{i = 1}^{m}{a_{i}b_{i}}}},$ wherein the addition is mod 2 operation.

Any linear function on F₂ ^(m) can be defined by an inner product ω·x, wherein ω=(ω₁, . . . , ω_(m)), x=(x₁, . . . , x_(m))∈F₂ ^(m). Each ω distinguishes different linear functions. A set containing all m-elementary linear functions is defined as L_(m), thus L_(m)={ω·x|ω∈F₂ ^(m)}.

B_(m) is set to represent a set of all m-elementary Boolean functions. For any f∈B_(m), the Walsh spectrum thereof is defined as follows:

${W_{f}(\omega)} = {\sum\limits_{x \in F_{2}^{m}}{\left( {- 1} \right)^{{f{(x)}} + {\omega \cdot x}}.}}$

supp(ƒ)={x∈F₂ ^(m)|ƒ(x)=1} is defined as a support set for the function ƒ. If the numbers of 0 and 1 in the truth table of the m-elementary function f∈B_(m) are equal, it is called the balance function, i.e., # supp(ƒ)=2^(m−1) or: W_(ƒ)(0_(m))=0, wherein 0_(m) represents a m-long 0 vector.

The sequence of function f∈B_(m) is N=2^(m)-long (1, −1) sequence, and defined as ƒ=((−1)^(ƒ(0, . . . , 0,0)), (−1)^(ƒ(0, . . . , 0,1)), . . . , (−1)^(ƒ(1, . . . , 1,1)).

The inner product of vectors ƒ ₁=(u₁, . . . , u_(N)) and ƒ ₂=(v₁, . . . , v_(N)) is expressed as ƒ ₁·ƒ ₂, defined as:

${\overset{\_}{f_{1}} \cdot \overset{\_}{f_{2}}} = {\sum\limits_{i = 1}^{N}{u_{i}{v_{i}.}}}$

Thus it can be seen that W_(ƒ)(ω)=ƒ·l, wherein l=ω·x.

A 2^(m)×2^(m) Hadamard matrix H_(m) is defined as: H₀=(1),

${H_{m} = \begin{pmatrix} H_{m - 1} & H_{m - 1} \\ H_{m - 1} & {- H_{m - 1}} \end{pmatrix}},$ m=1, 2, . . . .

r_(j), 0≤j≤2^(m)−1 is set to the jth column of H_(m), then r_(j) is a linear sequence, and is often called the set H={r_(j)|0≤j≤2^(m−)1}, which is a Hadamard sequence set, and it is obvious that H={l|l∈I_(m)}.

Definition 1:

$f_{1},{{f_{2} \in {B_{m}\mspace{14mu}{is}\mspace{14mu}{{set}.\mspace{14mu}{If}}\mspace{14mu}{\overset{\_}{f_{1}} \cdot \overset{\_}{f_{2}}}}} = {{\sum\limits_{x \in F_{2}^{m}}\left( {- 1} \right)^{{f_{1}{(x)}} + {f_{2}{(x)}}}} = 0}}$ satisfied ƒ ₁ and ƒ ₂ are orthogonal, which is expressed as ƒ ₁⊥ƒ ₂.

S={ƒ _(i)|ƒ_(i)∈B_(m), i=1, 2, . . . , κ} (11) is set.

If ƒ _(i) of the set S are orthogonal pairwise, S is called the orthogonal sequence set with the base κ. S₁ and S₂ are set to orthogonal sequence sets, for any ƒ ₁∈S, ƒ₂ ∈S, ƒ ₁·ƒ ₂=0 always, then, S₁ and S₂ are called to be orthogonal, which is expressed as S₁⊥S₂.

The orthogonal sequence has the following important properties.

Lemma 1: ƒ₁, ƒ₂∈B_(m) is set. Then ƒ ₁⊥ƒ ₂ is and only if W_(ƒ) ₁ _(+ƒ) ₂ (0_(m))=0.

For any two different linear functions l, l′∈L_(m), W_(l+l′)(0_(m))=0, then l⊥l′ is always true, that is, H is an orthogonal sequence set.

Definitions 2: if for any α∈F₂ ^(m), W_(ƒ)(α)∈{0, ±2^(λ)}, wherein λ≥m/2 is a positive integer, then such function is called the Plateaued function. When λ≥└(m+2)/2┘, the function is called the semi-bent function. If ƒ is a Plateaued function (semi-bent function), ƒ is called a Plateaued sequence (semi-bent sequence).

Definition 3: for any positive integer, m=s+t, and a Maiorana-McFarland function is defined as: ƒ(y,x)=ϕ(y)·x⊕g(y), y∈F₂ ^(s), x∈F₂ ^(t), wherein ϕ is random mapping of F₂ ^(s) to F₂ ^(t) and g∈B_(s).

When s≤t and ϕ is a single set, then the Maiorana-McFarland type function is the Plateaued function. In particular, when s=t and ϕ is bijective, then the Maiorana-McFarland type of the bent function is obtained.

Definition 4: an m variable-elementary t-dimensional vector function is a mapping function F:F₂ ^(m)

F₂ ^(l), or it can also be a t-elementary Boolean function set F(x)=(ƒ₁, . . . , ƒ_(t)). If any non-zero linear combination of component functions ƒ₁, . . . , ƒ_(t) is a three-value Plateaued Boolean function of which the spectral value is derived from {0±2^(λ)}. F is called a vector Plateaued function. When λ=└(m+2)/2┘, F is called the vector semi-bent function. If any non-zero linear combination of component functions ƒ₁, . . . , ƒ_(t) is a binary bent function of which the spectral value is derived from {±2^(m/2)}, then F is called a vector bent function, wherein m is an even number and t≤m/2.

Embodiment 2

Referring to FIG. 1, FIG. 1 is a flowchart of a method for constructing orthogonal sequence sets in a CDMA system according to an embodiment of the present invention. The method includes the following steps: step a: selecting natural numbers m and k, m and k satisfying m=2k+4: step b: constructing a 5-spectral value vector Boolean function; step e: constructing 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function; and step d: allocating the orthogonal sequence sets to cells, and causing that sequences in each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with one another.

Further, based on the above embodiment, walsh spectral values of the 5-spectral value vector Boolean function are {0, 2^(m/2), −2^(m/2), 2^((m/2)+1), −2^((m/2)+1)}, and the length of a 5-spectral value sequence corresponding to the 5-spectral value vector Boolean function is 2^(m).

In one embodiment of the present invention, the manner of constructing the 5-spectral value vector Boolean is as follows.

F₂ ^(k) is a k-dimensional vector space, F₂ _(k) is a finite field with a feature of 2, wherein GF(2) is the finite field in modern algebra, and (b₁, b₂, . . . b_(k))∈F₂ ^(k): γ is set to be a primitive element of F₂ _(k) , and {1, γ, . . . , γ^(k−1)} is a group of bases of F₂ _(k) , isomorphic π:F₂ _(k)

F₂ ^(k) is defined as that π(b₁+b₂γ+ . . . +b_(kγ) ^(k−1))=(b₁, b₂, . . . , b_(k)), for i=0, 1, ϕ₁:F₂ ^(k)→F₂ ^(k) is set to be a permutation and is defined as:

${\phi_{i}(y)} = \left\{ {\begin{matrix} {0_{k},} & {y = 0_{k}} \\ {{\pi\left( \gamma^{{\lbrack y\rbrack} + i} \right)},} & {y \in F_{2}^{k^{*}}} \end{matrix},} \right.$ wherein [y] is the decimal representation of y: ψ₀ and ψ₁ are set to be two permutations on F₂ ², and: ψ₁(00)=00, ψ₁(01)=10, ψ₁(10)=01, ψ₁(11)=11, ψ₂(00)=00, ψ₂(01)=01, ψ₂(10)=11, ψ₂(11)=10, X=(x₁, x₂, . . . , x_(m))∈F₂ ^(m), X₀=(x₃, . . . , x_(k+2))∈F₂ ^(k), X₁=(x_(k+3), . . . , x_(m−2))∈F₂ ^(k), X′₀=(x₂, . . . , x_(k+1))∈F₂ ^(k), and X′₁=(x_(k+2), . . . , x_(m−3))∈F₂ ^(k) are set; then the method for constructing the 5-spectral value vector Boolean function F F:F₂ ^(m)

F₂ ² is as follows: F(X)=(f₀(X), f₁(X)), t=0, 1,

${f_{i}(X)} = \left\{ {\begin{matrix} {{{{\phi_{i}\left( X_{0} \right)} \cdot X_{1}} + {{\psi_{i}\left( {x_{1},x_{2}} \right)} \cdot \left( {x_{m - 1},x_{m}} \right)}},} & {{{{if}\mspace{14mu}\left( {x_{1},x_{2}} \right)} \in \left\{ {10,11} \right\}},} & {X_{1} \in F_{2}^{k}} \\ {{{\phi_{i}\left( X_{0}^{\prime} \right)} \cdot X_{1}^{\prime}},} & {{{{if}\mspace{14mu} x_{1}} = 0},{X_{1}^{\prime} \in F_{2}^{k}}} & \; \end{matrix}.} \right.$

Further, based on the above embodiment, constructing 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function specifically includes: dividing a 2^(m)×2^(m) dimensional Hadamard matrix into six orthogonal sequence sets according to a set rule, wherein any one of two of the six orthogonal sequence sets contains 2^(m−2) sequences, and any one of the remaining four of the six orthogonal sequence sets contains 2^(m−3) sequences: obtaining four 5-spectral value Boolean functions according to the 5-spectral value vector Boolean functions: converting truth tables of the four 5-spectral value Boolean functions into 1 or −1 to form four 5-spectral value sequence sets, wherein converting truth tables of the four 5-spectral value Boolean function into 1 or −1 specifically includes: if the value of the 5-spectral value Boolean function is 0, then recording the value of the 5-spectral value Boolean function as 1 in the truth table, and if the value of the 5-spectral value Boolean function as 1, then recording the value of the 5-spectral value Boolean function as −1 in the truth table; and multiplying each of the six orthogonal sequence sets by the four 5-spectral value sequence sets individually to obtain 24 orthogonal sequence sets.

Specifically, in one embodiment, for c∈F₂ ², ƒ_(c)=c·F is set, and H_(α) ^(ƒ) ^(c) ={ƒ_(c)l| l=(β,α)·X, β∈F₂ ^(m−3)}.

H₁₀ ^(ƒ) ^(c) =H₀₁₀ ^(ƒ) ^(c) ∪H₁₁₀ ^(ƒ) ^(c) and H₀₁ ^(ƒ) ^(c) ∠H₁₀₁ ^(ƒ) ^(c) are set.

24 different sequence sets can be obtained, wherein for c∈F₂ ², |H₁₀ ^(ƒ) ^(c) |=|H₀₁ ^(ƒ) ^(c) |=2^(m−2) and |H_(α) ^(ƒ) ^(c) |=2^(m−3) when α∈{000, 100, 011, 111}.

Embodiment 3

The present embodiment further explains the effect of the generating manner for the orthogonal sequence sets provided in embodiment 2.

The sequence set is set to be obtained by H_(α) ^(ƒ) ^(c) ={ƒ₂+l|l=(β,α)·X, β∈F₂ ^(m−3)}, then there are the following conclusions.

1. For any c∈F₂ ², H_(α) ^(ƒ) ^(c) is an orthogonal sequence set, and for any α≠α′, H_(α) ^(ƒ) ^(c) ⊥H_(α) ^(ƒ) ^(c) .

2. S∈H_(α) ^(ƒ) ^(c) and s′∈H_(α′) ^(ƒ) ^(d) are set, wherein c≠c¹, then:

${s \cdot s^{\prime}} = \left\{ {\begin{matrix} {{\pm 2^{{m/2} + 1}},} & {{{if}\mspace{14mu}\alpha} = \alpha^{\prime}} \\ {0,} & {{{{if}\mspace{14mu}\alpha} + \alpha^{\prime}} \in {\left\{ {\left( {0,{c + c^{\prime}}} \right),\left( {1,{c + c^{\prime}}} \right),100} \right\}.}} \\ {{\pm 2^{m/2}},} & {otherwise} \end{matrix}.} \right.$

The reasons for the above conclusions are explained below.

For any α≠α′, H_(α)⊥H_(α′), H_(α) ^(ƒ)is an orthogonal set, and the number of dimension is 2^(m−3) for any α∈F₂ ³.

For s∈H_(α) ^(ƒ) ^(c) , s′∈H_(α′) ^(ƒ) ^(c′) , the cross-correlation thereof is calculated by the formula

${\sum\limits_{X \in F_{2}^{m}}\left( {- 1} \right)^{{f_{c}{(X)}} + {f_{c^{\prime}}{(X)}} + {{({\beta,\alpha})} \cdot X} + {{({\beta^{\prime},\alpha^{\prime}})} \cdot X}}} = {\sum\limits_{X \in F_{2}^{m}}{\left( {- 1} \right)^{{f_{c + c^{\prime}}{(X)}} + {{({{\beta + \beta^{\prime}},{\alpha + \alpha^{\prime}}})} \cdot X}}.}}$

S1 is et to be equal to

$\sum\limits_{x_{1} = 0}{\left( {- 1} \right)^{{{\phi_{c + c^{\prime}}{(X_{0}^{\prime})}} \cdot X_{1}^{\prime}} + {{({{\beta + \beta^{\prime}},{\alpha + \alpha^{\prime}}})} \cdot X}}.}$

S2 is set to be equal to

$\sum\limits_{{x_{1} = 1},{x_{2} = 0}}{\left( {- 1} \right)^{{{\phi_{c + c^{\prime}}{(X_{0})}} \cdot X_{1}} + {{\varphi_{c + c^{\prime}}{({x_{1},x_{2}})}} \cdot {({x_{m - 1},x_{m}})}} + {{({{\beta + \beta^{\prime}},{\alpha + \alpha^{\prime}}})} \cdot X}}.}$

S3 is set to be equal to

$\sum\limits_{{x_{1} = 1},{x_{2} = 1}}{\left( {- 1} \right)^{{{\phi_{c + c^{\prime}}{(X_{0})}} \cdot X_{1}} + {{\varphi_{c + c^{\prime}}{({x_{1},x_{2}})}} \cdot {({x_{m - 1},x_{m}})}} + {{({{\beta + \beta^{\prime}},{\alpha + \alpha^{\prime}}})} \cdot X}}.}$

When α=α′, s1=±s^(k+3)=±2^(m/s+1), and s2+S3=0.

When α+α′=100, s1=0, and s2+s3=0.

When α+α′∈(0, c+c′), (1, c−c′), s1=0, and s2+s3=0.

When α,α′ are in other cases, the first cumulative equation is zero, and the cumulative sum of one of the second and third cumulative equations is 0, and the cumulative sum of the other is 0, so that the cross-correlation values in the remaining cases are all ±2^(m/2).

Embodiment 4

The present embodiment describes a method for allocating the generated orthogonal sequences to a plurality of cells based on the above embodiments.

Referring to Table 1, Table 1 is a cross-correlation value comparison table of any two sequence sets obtained according to the embodiment of the present invention.

TABLE 1 Cross-correlation values of orthogonal sequence sets H₀₀₀ H₁₀₀ H₀₀₁ H₁₀₁ H₀₁₀ H₁₁₀ H₀₁₁ H₁₁₁ H₀₀₀ ^(f) ¹⁰  ±2^(m/2+1) 0  ±2^(m/2) ±2^(m/2) 0  0  ±2^(m/2) ±2^(m/2) H₁₀₀ ^(f) ¹⁰ 0   ±2^(m/2+1) ±2^(m/2) ±2^(m/2) 0  0  ±2^(m/2) ±2^(m/2) H₀₀₁ ^(f) ¹⁰ ±2^(m/2) ±2^(m/2)  ±2^(m/2+1) 0  ±2^(m/2) ±2^(m/2) 0  0  H₁₀₁ ^(f) ¹⁰ ±2^(m/2) ±2^(m/2) 0   ±2^(m/2+1) ±2^(m/2) ±2^(m/2) 0  0  H₀₁₀ ^(f) ¹⁰ 0  0  ±2^(m/2) ±2^(m/2) ±2^(m/2+1) 0  ±2^(m/2) ±2^(m/2) H₁₁₀ ^(f) ¹⁰ 0  0  ±2^(m/2) ±2^(m/2) 0   ±2^(m/2+1) ±2^(m/2) ±2^(m/2) H₀₁₁ ^(f) ¹⁰ ±2^(m/2) ±2^(m/2) 0  0  ±2^(m/2) ±2^(m/2)  ±2^(m/2+1) 0  H₁₁₁ ^(f) ¹⁰ ±2^(m/2) ±2^(m/2) 0  0  ±2^(m/2) ±2^(m/2) 0   ±2^(m/2+1) H₀₀₀ ^(f) ⁰¹  ±2^(m/2+1) 0  0  0  ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) H₁₀₀ ^(f) ⁰¹ 0   ±2^(m/2+1) 0  0  ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) H₀₀₁ ^(f) ⁰¹ 0  0  0   ±2^(m/2+1) ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) H₁₀₁ ^(f) ⁰¹ 0  0   ±2^(m/2+1) 0  ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) H₀₁₀ ^(f) ⁰¹ ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) 0   ±2^(m/2+1) 0  0  H₁₁₀ ^(f) ⁰¹ ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2+1) 0  0  0  H₀₁₁ ^(f) ⁰¹ ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) 0  0   ±2^(m/2+1) 0  H₁₁₁ ^(f) ⁰¹ ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) 0  0  0   ±2^(m/2+1) H₀₀₀ ^(f) ¹¹  ±2^(m/2+1) 0  ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) 0  0  H₁₀₀ ^(f) ¹¹ 0   ±2^(m/2+1) ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) 0  0  H₀₀₁ ^(f) ¹¹ ±2^(m/2) ±2^(m/2) 0   ±2^(m/2+1) 0  0  ±2^(m/2) ±2^(m/2) H₁₀₁ ^(f) ¹¹ ±2^(m/2) ±2^(m/2)  ±2^(m/2+1) 0  0  0  ±2^(m/2) ±2^(m/2) H₀₁₀ ^(f) ¹¹ ±2^(m/2) ±2^(m/2) 0  0  0   ±2^(m/2+1) ±2^(m/2) ±2^(m/2) H₁₁₀ ^(f) ¹¹ ±2^(m/2) ±2^(m/2) 0  0  ±2^(m/2+1) 0  ±2^(m/2) ±2^(m/2) H₀₁₁ ^(f) ¹¹ 0  0  ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2)  ±2^(m/2+1) 0  H₁₁₁ ^(f) ¹¹ 0  0  ±2^(m/2) ±2^(m/2) ±2^(m/2) ±2^(m/2) 0   ±2^(m/2+1)

Further, after allocating the allocating the orthogonal sequence sets to cells, and causing that sequences in each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with one another, the following step may be executed: minimizing a correlation value of mutually spaced ones of cells to reduce the interference of the CMDA system.

Referring to FIG. 2, FIG. 2 is a schematic diagram of allocating sequence sets in a plurality of cells according to an embodiment of the present invention. Specifically, the distance between two adjacent cells is set to 1, that is, the distance between the center points of two adjacent regular hexagons in FIG. 2 is 1, then the multiplexing distance of the CDMA system in FIG. 2 is D=4. Such arrangement ensures the orthogonality of the neighboring cells and effectively suppresses the interference from the neighboring cells. In FIG. 2. H_(o) is an abbreviation for H_(α) ^(f) ⁰⁰ .

Embodiment 5

FIG. 3 is a schematic structural diagram of a code word generating device according to the present invention. The code word generating device is applied to a CDMA wireless communication system, and includes a sequence generating unit, configured to generate orthogonal sequence sets; a storage unit, electrically connected to the sequence generating unit, and configured to store the orthogonal sequence sets; a reading unit, electrically connected to the storage unit, and configured to read the orthogonal sequence sets under the action of a control signal; and a transceiving unit, electrically connected to the reading unit, and configured to receive and transmit user information coded by using the orthogonal sequence sets.

Further, based on the above embodiment, referring to FIG. 4, FIG. 4 is a schematic structural diagram of a sequence generating unit according to the present invention.

The sequence generating unit includes: a selecting subunit, configured to select natural numbers m and k, m and k satisfying m=2k+4; a first constructing subunit, connected to the selecting subunit, and configured to construct a 5-spectral value vector Boolean function; a second constructing subunit, connected to the first constructing subunit, and configured to construct 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function, and an allocating subunit, connected to the second constructing subunit, and configured to allocate the orthogonal sequence sets to cells according to a preset rule/algorithm, and cause that sequences in each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with one another.

Further, walsh spectral values of the 5-spectral value vector Boolean function are {0, 2^(m/2), −2^(m/2), 2^((m/2)+1), −2^((m/2)+1))}, and the length of a 5-spectral value sequence corresponding to the 5-spectral value Boolean function is 2^(m).

Further based on the above embodiment, the first constructing subunit is specifically configured for the F₂ ^(k) is a k-dimensional vector space. F₂ _(k) is a finite field with a feature of 2, and (b₁, b₂, . . . , b_(k))∈F₂ ^(k): γ is set to be a primitive element of F₂ _(k) , and {1, γ, . . . , γ^(k−1)} is a group of bases of F₂ _(k) , isomorphic π:F₂ _(k)

F₂ ^(k) is defined as π(b₁+b₂γ+ . . . +b_(kγ) ^(k−1))=(b₁, b₂, . . . b_(k)), for i=0, 1, ϕ₁:F₂ ^(k)→F₂ ^(k) is set to be a permutation and is defined as

${\phi_{i}(y)} = \left\{ {\begin{matrix} {0_{k},} & {y = 0_{k}} \\ {{\pi\left( \gamma^{{\lbrack y\rbrack} + i} \right)},} & {y \in F_{2}^{k^{*}}} \end{matrix},} \right.$ wherein [y] is a decimal representation of y: ψ₀ and ψ₁ are set to be two permutations of F₂ ², and: ψ₁(00)=00, ψ₁(01)=10, ψ₁(10)=01, ψ₁(11)=11, ψ′₂(00)=00, ψ₂(01)=01, ψ₂(10)=11, ψ₂(11)=10, X=(x₁, x₂, . . . , x_(m))∈F₂ ^(m). X₀=(x₃, . . . , x_(k+2))∈F₂ ^(k). X₁=(x_(k+3), . . . , x_(m+2))∈F₂ ^(k). X′₀=(x₂, . . . , x_(k+1))∈F₂ ^(k), and X′₁=(x_(k+2), . . . , x_(m+3))∈F₂ ^(k) are set; then the method for constructing the 5-spectral value vector Boolean function F F:F₂ ^(m)

F₂ ² is as follows: F(X)=(f₀(X), f₁(X)), i=0, 1,

${f_{i}(X)} = \left\{ {\begin{matrix} {{{{\phi_{i}\left( X_{0} \right)} \cdot X_{1}} + {{\psi_{i}\left( {x_{1},x_{2}} \right)} \cdot \left( {x_{m - 1},x_{m}} \right)}},} & {{{{if}\mspace{14mu}\left( {x_{1},x_{2}} \right)} \in \left\{ {10,11} \right\}},} & {X_{1} \in F_{2}^{k}} \\ {{{\phi_{i}\left( X_{0}^{\prime} \right)} \cdot X_{1}^{\prime}},} & {{{{if}\mspace{14mu} x_{1}} = 0},{X_{1}^{\prime} \in F_{2}^{k}}} & \; \end{matrix}.} \right.$

Further, based on the above embodiment, referring to FIG. 5, FIG. 5 is a schematic structural diagram of a second constructing subunit according to the present invention.

The second constructing subunit includes: a dividing module, configured to divide a 2^(m)×2^(m) dimensional Hadamard matrix into six orthogonal sequence sets according to a preset rule, wherein any one of two of the six orthogonal sequence sets contains 2^(m−2) sequences, and any one of the remaining four of the six orthogonal sequence sets contains 2^(m−3) sequences; an obtaining module, connected to the dividing module, and configured to obtain four 5-spectral value Boolean functions according to the 5-spectral value vector Boolean function; a converting module, connected to the dividing module, and configured to convert truth tables of the four 5-spectral value Boolean functions into 1 or −1 to form four 5-spectral value sequence sets; and a multiplying module, connected to the converting module, and configured to multiply each of the six orthogonal sequence sets by the four 5-spectral value sequence sets individually to obtain 24 orthogonal sequence sets.

The present invention further provides a communication base station, including the code word generating device according to any one of above embodiments.

The present invention further provides a base station controller, including the code word generating device according to any one of the above embodiments.

The present invention further provides a wireless communication network, including the communication base station according to any one of above embodiments or the base station controller according to any one of above embodiments.

The code word generating device, the communication base station, and the wireless communication network provided by the present invention can increase the number of users in the cells, reduce the signal interference of the neighboring cells, and improves the communication quality consequently.

Finally, the present invention provides a system for constructing orthogonal sequence sets in a CDMA system includes: a processor and a memory. The memory stores instructions executed by the processor, and the instructions cause the processor to perform operations to perform any one of the methods for constructing orthogonal sequence sets in a CDMA system as described above.

While the invention has been described in terms of what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention needs not be limited to the disclosed embodiment. On the contrary, it is intended to cover various modifications and similar arrangements included within the spirit and scope of the appended claims which are to be accorded with the broadest interpretation so as to encompass all such modifications and similar structures. 

What is claimed is:
 1. A method for constructing orthogonal sequence sets in a CDMA (code division multiple access) system, comprising: step a: selecting natural numbers in and k, in and k satisfying m=2k+4; step b: constructing a 5-spectral value vector Boolean function; step c: constructing 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function; and step d: allocating the orthogonal sequence sets to cells, and causing that sequences within each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with one another; wherein the method further comprises: using the orthogonal sequence sets allocated to the cells to code user information to obtain coded user information, and transmitting the coded user information for CDMA mobile communication.
 2. The method according to claim 1, wherein walsh spectral values of the 5-spectral value vector Boolean function are {0, 2^(m/2), −2^(m/2), 2^((m/2)+1), −2^((m/2)+1)}, and a length of a 5-spectral value sequence corresponding to the 5-spectral value vector Boolean function is 2^(m).
 3. The method according to claim 2, wherein the step b of constructing a 5-spectral value vector Boolean function comprises: F₂ ^(k) is a k-dimensional vector space, F₂ _(k) is a finite field with a feature of 2, and (b₁, b₂, . . . , b_(k))∈F₂ ^(k): γ is set to be a primitive element of F₂ _(k) , and {1, γ, . . . , γ^(k−1)} is a group of bases of F₂ _(k) , isomorphic π:F₂ _(k)

F₂ ^(k) is defined as that π(b₁+b₂γ+ . . . +b_(k)γ^(k−1))=(b₁, b₂, . . . , b_(k)), for i=0, 1, ϕ_(i):F₂ ^(k)→F₂ ^(k) is set to be a permutation and is defined as: ${\phi_{i}(y)} = \left\{ {\begin{matrix} {0_{k},} & {y = 0_{k}} \\ {{\pi\left( \gamma^{{\lbrack y\rbrack} + i} \right)},} & {y \in F_{2}^{k^{*}}} \end{matrix},} \right.$ wherein [y] is a decimal representation of y; ψ₀ and ψ₁ are set to be two permutations on F₂ ², and: ψ₁(00)=00, ψ₁(01)=10, ψ₁(10)=01, ψ₁(11)=11, ψ₂(00)=00, ψ₂ (01)=01, ψ₂(10)=11, ψ₂(11)=10, X=(x₁, x₂, . . . , x_(m))∈F₂ ^(m), X₀=(x₃, . . . , x_(k+2))∈F₂ ^(k), X₁=(x_(k+3), . . . , x_(m−2))∈F₂ ^(k), X′₀=(x₂, . . . , x_(k+1))∈F₂ ^(k), and X′₁=(x_(k+2), . . . , x_(m−3))∈F₂ ^(k) are set; then a method for constructing the 5-spectral value vector Boolean function F F:F₂ ^(k)

F₂ ² is as follows: ${{F(X)} = \left( {{f_{0}(X)},{f_{1}(X)}} \right)},{i = 0},1,{{f_{i}(X)} = \left\{ {\begin{matrix} {{{{\phi_{i}\left( X_{0} \right)} \cdot X_{1}} + {{\psi_{i}\left( {x_{1},x_{2}} \right)} \cdot \left( {x_{m - 1},x_{m}} \right)}},} & {{{{if}\mspace{14mu}\left( {x_{1},x_{2}} \right)} \in \left\{ {10,11} \right\}},} & {X_{1} \in F_{2}^{k}} \\ {{{\phi_{i}\left( X_{0}^{\prime} \right)} \cdot X_{1}^{\prime}},} & {{{{if}\mspace{14mu} x_{1}} = 0},{X_{1}^{\prime} \in F_{2}^{k}}} & \; \end{matrix}.} \right.}$
 4. The method according to claim 3, wherein the step c of constructing 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function comprises: dividing a 2^(m)×2^(m) dimensional Hadamard matrix into six orthogonal sequence sets according to a preset rule, wherein any one of two of the six orthogonal sequence sets contains 2^(m−2) sequences, and any one of remaining four of the six orthogonal sequence sets contains 2^(m−3) sequences; obtaining four 5-spectral value Boolean functions according to the 5-spectral value vector Boolean function; converting truth tables of the four 5-spectral value Boolean functions into 1 or −1, to thereby form four 5-spectral value sequence sets; and multiplying each of the six orthogonal sequence sets by the four 5-spectral value sequence sets individually to obtain the 24 orthogonal sequence sets.
 5. The method according to claim 4, wherein the step of converting truth tables of the four 5-spectral value Boolean functions into 1 or −1 comprises: recording a value of the 5-spectral value Boolean function as 1 in the truth table, if the value of the 5-spectral value Boolean function is 0; and recording a value of the 5-spectral value Boolean function as −1 in the truth table, if the value of the 5-spectral value Boolean function is
 1. 6. The method according to claim 5, after the step d of allocating the orthogonal sequence sets to cells, and causing that sequences within each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with another, further comprising: minimizing a correlation value mutually spaced ones of the cells, so as to reduce interference of the CDMA system.
 7. A code word generating device, applied to a CDMA wireless communication system, and comprising: a processor and a memory storing instructions executable by the processor, wherein the processor is configured to execute the instructions to generate orthogonal sequence sets; a storage circuit, electrically connected to the processor, and configured to store the orthogonal sequence sets; a reading circuit, electrically connected to the storage circuit, and configured to read the orthogonal sequence sets subjected to a control signal; and a transceiver, electrically connected to the reading circuit, and configured to receive and transmit user information coded by using the orthogonal sequence sets; wherein the processor is configured to execute the instructions to generate orthogonal sequence sets comprises: select natural numbers in and k, in and k satisfying m=2k+4; construct a 5-spectral value vector Boolean function; construct 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function; and allocate the orthogonal sequence sets to cells according to a preset rule, and cause that sequences in each of the cells are orthogonal with one another, and sequences in each of the cells and sequences in neighboring one of the cells are orthogonal with one another.
 8. The code word generating device according to claim 7, wherein walsh spectral values of the 5-spectral value vector Boolean function are {0, 2^(m/2), −2^(m/2), 2^((m/2)+1), −2^((m/2)+1)}, and a length of a 5-spectral value sequence corresponding to the 5-spectral value vector Boolean function is 2′.
 9. The code word generating device according to claim 8, wherein the processor is configured to execute the instructions to construct a 5-spectral value vector Boolean function comprises: F₂ ^(k) is a k-dimensional vector space, F₂ _(k) is a finite field with a feature of 2, and (b₁, b₂, . . . , b_(k))∈F₂ ^(k): γ is set to be a primitive element of F₂ _(k) , and {1, γ, . . . , γ^(k−1)} is a group of bases of F₂ _(k) , isomorphic π:F₂ _(k)

F₂ ^(k) is defined as that π(b₁+b₂γ+ . . . +b_(k)γ^(k−1))=(b₁, b₂, . . . , b_(k)), for i=0, 1, ϕ_(i):F₂ ^(k)→F₂ ^(k) is set to be a permutation and is defined as: ${\phi_{i}(y)} = \left\{ {\begin{matrix} {0_{k},} & {y = 0_{k}} \\ {{\pi\left( \gamma^{{\lbrack y\rbrack} + i} \right)},} & {y \in F_{2}^{k^{*}}} \end{matrix},} \right.$ wherein [y] is a decimal representation of y; ψ₀ and ψ₁ are set to be two permutations on F₂ ², and: ψ₁(00)=00, ψ₁(01)=10, ψ₁(10)=01, ψ₁(11)=11, ψ₂(00)=00, ψ₂ (01)=01, ψ₂(10)=11, ψ₂(11)=10, X=(x₁, x₂, . . . , x_(m))∈F₂ ^(m), X₀=(x₃, . . . , x_(k+2))∈F₂ ^(k), X₁=(x_(k+3), . . . , x_(m−2))∈F₂ ^(k), X′₀=(x₂, . . . , x_(k+1))∈F₂ ^(k), and X′₁=(x_(k+2), . . . , x_(m−3))∈F₂ ^(k) are set; then a method for constructing the 5-spectral value vector Boolean function F F:F₂ ^(k)

F₂ ² is as follows: ${{F(X)} = \left( {{f_{0}(X)},{f_{1}(X)}} \right)},{i = 0},1,{{f_{i}(X)} = \left\{ {\begin{matrix} {{{{\phi_{i}\left( X_{0} \right)} \cdot X_{1}} + {{\psi_{i}\left( {x_{1},x_{2}} \right)} \cdot \left( {x_{m - 1},x_{m}} \right)}},} & {{{{if}\mspace{14mu}\left( {x_{1},x_{2}} \right)} \in \left\{ {10,11} \right\}},} & {X_{1} \in F_{2}^{k}} \\ {{{\phi_{i}\left( X_{0}^{\prime} \right)} \cdot X_{1}^{\prime}},} & {{{{if}\mspace{14mu} x_{1}} = 0},{X_{1}^{\prime} \in F_{2}^{k}}} & \; \end{matrix}.} \right.}$
 10. The code word generating device according to claim 9, wherein the processor is configured to execute the instructions to construct 24 orthogonal sequence sets by using the 5-spectral value vector Boolean function comprises: divide a 2^(m)×2^(m) dimensional Hadamard matrix into six orthogonal sequence sets according to a preset rule, wherein any one of two of the six orthogonal sequence sets contains 2^(m−2) sequences, and any one of remaining four of the six orthogonal sequence sets contains 2^(m−3) sequences; obtain four 5-spectral value Boolean functions according to the 5-spectral value vector Boolean function; convert truth tables of the four 5-spectral value Boolean functions into 1 or −1, to form four 5-spectral value sequence sets; and multiply each of the six orthogonal sequence sets by the four 5-spectral value sequence sets individually to obtain the 24 orthogonal sequence sets. 